A note on adiabatic theorem for Markov chains and adiabatic quantum computation
نویسنده
چکیده
We derive an adiabatic theorem for Markov chains using well known facts about mixing and relaxation times. We discuss the results in the context of the recent developments in adiabatic quantum computation.
منابع مشابه
A note on adiabatic theorem for Markov chains
We state and prove a version of an adiabatic theorem for Markov chains using well known facts about mixing times. We extend the result to the case of continuous time Markov chains with bounded generators.
متن کاملAdiabatic times for Markov chains and applications
We state and prove a generalized adiabatic theorem for Markov chains and provide examples and applications related to Glauber dynamics of the Ising model over Zd/nZd. The theorems derived in this paper describe a type of adiabatic dynamics for `(R+) norm preserving, time inhomogeneous Markov transformations, while quantum adiabatic theorems deal with `2(Cn) norm preserving ones, i.e. gradually ...
متن کاملQuantum-Merlin-Arthur-complete problems for stoquastic Hamiltonians and Markov matrices
We show that finding the lowest eigenvalue of a 3-local symmetric stochastic matrix is Quantum-MerlinArthur-complete (QMA-complete). We also show that finding the highest energy of a stoquastic Hamiltonian is QMA-complete and that adiabatic quantum computation using certain excited states of a stoquastic Hamiltonian is universal. We also show that adiabatic evolution in the ground state of a st...
متن کاملConsistency of the Adiabatic Theorem
The adiabatic theorem provides the basis for the adiabatic model of quantum computation. Recently the conditions required for the adiabatic theorem to hold have become a subject of some controversy. Here we show that the reported violations of the adiabatic theorem all arise from resonant transitions between energy levels. In the absence of fast driven oscillations the traditional adiabatic the...
متن کاملAdiabatic Quantum State Generation
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to this task by studying the problem of quantum state generation. We motivate this problem by showing that the entire class of statistical zero knowledge, which contains natural candidates for efficient quantum algorithms such as graph isomorphism and lattice problems, ca...
متن کامل